package com.example.leetdemo.process;

import java.util.Collections;

public class Solution1911 {

    public long maxAlternatingSum(int[] nums) {
        long[] dp = new long[nums.length];
        dp[0] = nums[0];
        long sum = 0, max = -1000007;
        for (int i = 1; i < nums.length; i++) {
            if ((i & 1) == 0) {
                nums[i] = -nums[i];
            }
            sum += nums[i];
//            for (int j = 0; j < )
            dp[i] = Math.max(nums[i], dp[i - 1]);
        }

        return 0;
    }

}
